MIMD上三层格式的窗口并行迭代方法

本文对一般的三层格式给出了在MIMD 机上实现的窗口并行迭代方法,给出了WBJ 格式,分析了三层格式的收敛性。文章的结论表明窗口并行迭代法的收敛性与窗口大小无关,窗口大小影响每台处理机的使用效率。     

基于渐进性的线性方程组教学设计的研究

针对线性方程组传统教学中的一些问题,给出了引入线性方程组、解线性方程组、分析解结构的渐进性三步教学设计,同时给出了maple求解线性方程组的两种方法,将理论与实践初步结合了起来,丰富了教学手段,激发了学生的学习兴趣。     

Lanchester for cyber: The mixed epidemic‐combat model

Future conflict between armed forces will occur both in the physical domain as well as the information domain. The linkage of these domains is not yet fully understood. We study the dynamics of a force subject to kinetic effects as well as a specific network effect–spreading malware. In the course of our study, we unify two well‐studied models: the Lanchester model of armed conflict and deterministic models of epidemiology. We develop basic results, including a rule for determining when explicit modeling of network propagation is required. We then generalize the model to a force subdivided by both physical and network topology, and demonstrate the specific case where the force is divided between front‐ and rear‐echelons. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

一类微分方程组极限环的不存在性

在系统奇点唯一的条件下,研究了一类微分方程组不存在极限环的的充分条件,运用和发展了以往的结果。     

一类非线性脉冲时滞抛物型偏微分方程组解的振动性

讨论了一类含脉冲的时滞抛物型方程组非零解的振动性,利用了Green定理以及Jensen不等式,得出了该方程在Robin边界条件下非零解振动的若干准则。     

谐波平衡法数值模拟周期性非定常流动

谐波平衡法是目前非定常流动数值研究中颇受关注的频域计算方法,该方法计算效率高,特别是对于周期性非定常流动问题具有明显的计算优势。采用谐波平衡法数值模拟高超声速导弹标模模型在不同参数下的强迫俯仰振动,重建气动力/力矩系数迟滞曲线,将计算结果与时域方法相比较,详细考察谐波平衡法的计算精度、效率和内存需求,分析不同参数对谐波平衡法计算的影响。计算结果表明,谐波平衡法适用于中小振幅下的非定常流动计算,且计算时间基本不受减缩频率的影响,对于长周期低频问题,较时域方法有明显计算优势。     

线性方程组迭代解法的另类矩阵形式

改进了线性方程组迭代解法的矩阵形式．以最简单的Jacobi迭代法的迭代矩阵为基础,只需经过简单的加减和数乘运算就可得到Seidel和SOR的迭代过程,使得算法新形式的求解过程数学意义非常明确,表达形式也非常简洁,这样不仅便于理解记忆,还非常有利于编程实现。改进后的矩阵迭代形式求解计算量为:Seidel需要大约n2次乘除法．SOR约为2n2次乘除法,且改进后的Seidel迭代法和SOR方法存储空间也较传统形式为少。     

奇型偏微分方程的柯西问题

定解条件给在奇线上的偏微分方程的各种定解问题早已有研究^[1～4],多数作者使用了特殊函数作工具。本文用能量不等式组来解决一类奇型双曲型方程的柯西问题。 本文主要讨论如下问题解尚存在唯一性： Lu≡[(t^a/2?_t-λ₁(x,t)?_x)(t^a/2?_t-λ₂(x,t) ?_x)+a(x,t)?_t+b(x,t)?_x+c(x,t)]u(x,t)=f(x,t) (x,t)∈R×(0,T] u∣_t=0=φ(x),limt^a/2u_t=ψ(x) 这是一个二阶偏微分方程,当 α>0时,?_t²的系数当t=O 时变为零,因而这是一个初始值给在奇线上的柯西问题。我们假定： (A) α为常数,0<α<1;所涉及的都是实函数; (B) α(x,t),b(x,t),c(x,t),λ_j(x,t)(j=1,2)∈C¹([0,T],C²(R)),且上述函数的所有可能的导数都有界; (C) φ(x),ψ(x)∈C₀⁴(R)); （D）f(x,t)∈C((0,T],C₀²(R)),且sup{t^a/2(∣f∣+∣f_x∣+∣f_xx∣}＜+∞（Ⅱ） (E)存在常数δ＞0,使当（x,t)∈R×[0,T]时,有：∣λ₁(x,t)-λ₂(x,t)∣≥δ条件（Ⅱ）中关于实函数的假设不是必要的,作此假设仅为方便。本文主要得到：定理1：在（Ⅱ）的假设下,（Ⅰ）存在唯一弱解u,并 u∈C([0,T),H¹(R))∩C¹((0,T),L₂(R)).为证明该定理作了一系列准备,关键是证得引理1,引理2和引理6。     

一类广义Liénard方程极限环的不存在性

利用Cauchy问题解的唯一性,研究了一类二阶非线性微分方程极限环的不存在性,得到了在奇点唯一的条件下极限环的不存在的充分条件,所得结果运用和发展了以往的方法。     

Fitting Lanchester equations to the battles of Kursk and Ardennes

Lanchester equations and their extensions are widely used to calculate attrition in models of warfare. This paper examines how Lanchester models fit detailed daily data on the battles of Kursk and Ardennes. The data on Kursk, often called the greatest tank battle in history, was only recently made available. A new approach is used to find the optimal parameter values and gain an understanding of how well various parameter combinations explain the battles. It turns out that a variety of Lanchester models fit the data about as well. This explains why previous studies on Ardennes, using different minimization techniques and data formulations, have found disparate optimal fits. We also find that none of the basic Lanchester laws (i.e., square, linear, and logarithmic) fit the data particularly well or consistently perform better than the others. This means that it does not matter which of these laws you use, for with the right coefficients you will get about the same result. Furthermore, no constant attrition coefficient Lanchester law fits very well. The failure to find a good‐fitting Lanchester model suggests that it may be beneficial to look for new ways to model highly aggregated attrition. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.